package leetcodecompetition.S102;

import org.junit.jupiter.api.Test;

public class T6333 {
    public int[] findColumnWidth(int[][] grid) {
        int m=grid.length;
        int n=grid[0].length;
        int[] res=new int[n];
        for (int i = 0; i <n ; i++) {
            int max=0;
            for (int j = 0; j <m ; j++) {
                max=Math.max(max,Integer.toString(grid[j][i]).length());
            }
            res[i]=max;
        }
        return res;
    }


    public int len(int a){
        int len=Integer.toString(a).length();
        return len;
    }


    @Test
    public void test() {
        System.out.println(len(-10));

    }
}
